A combinatorial identity with applications to forest graphs
نویسندگان
چکیده
We give an elementary proof of interesting combinatorial identity which is particular interest in graph theory and its applications. Two applications to enumeration forests with closed-form expressions are given.
منابع مشابه
A Combinatorial Identity and Applications
An identity for the finite sum ∑N 1 z qn−r is given. Related sums (or series) were studied by Scherk, Clausen, Ramanujan, Shanks, Andrews, and others. We use such identity to give new formulas for ∑∞ 1 z qn−r , the Riemann zeta function and the Euler–Mascheroni constant. An irrationality result is also proved.
متن کاملA Combinatorial Identity Concerning Plane Colored Trees and its Applications
In this note, we obtain a combinatorial identity by counting some colored plane trees. This identity has a plethora of implications. In particular, it solves a bijective problem in Stanley’s collection “Bijective Proof Problems”, and gives a formula for the Narayana polynomials, as well as an equivalent expression for the Harer-Zagier formula enumerating unicellular maps.
متن کاملA combinatorial identity with application to Catalan numbers
By a very simple argument, we prove that if l, m, n ∈ {0, 1, 2, . . . } then
متن کاملA Combinatorial Identity with Application to Catalan Numbers 3
l k=0 (−1) m−k l k m − k n 2k k − 2l + m = l k=0 l k 2k n n − l m + n − 3k − l. On the basis of this identity, for d ∈ {0, 1, 2,. .. } and ε ∈ {0, ±1} we construct explicit f ε (d) and g ε (d) such that for any prime p > d we have p−1 k=1 k ε C k+d ≡ f ε (d) if p ≡ 1 (mod 3), g ε (d) if p ≡ 2 (mod 3), where C n denotes the Catalan number 1 n+1 2n n ; for example, if p 5 is a prime then 0<k<p−4 ...
متن کاملA Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
We consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. For an n × n 0 − 1 matrix C, let KC be the complete weighted graph on the rows of C where the weight of an edge between two rows is equal to their Hamming distance. Let MWT (C) be the weight of a minimum weight spanning tree of KC . We show that the all-pairs shortest path p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2020.112270